Quantum Metropolis sampling
نویسندگان
چکیده
منابع مشابه
Metropolis Sampling
Monte Carlo (MC) sampling methods are widely applied in Bayesian inference, system simulation and optimization problems. The Markov Chain Monte Carlo (MCMC) algorithms are a well-known class of MC methods which generate a Markov chain with the desired invariant distribution. In this document, we focus on the Metropolis-Hastings (MH) sampler, which can be considered as the atom of the MCMC techn...
متن کاملMetropolis-Hastings sampling of paths
We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and hence also forbids to compute the normalizing constant of the sampling distribution. The problem is important because the ability to...
متن کاملA quantum-quantum Metropolis algorithm.
The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamilto...
متن کاملAdaptive Metropolis Sampling with Product Distributions
The Metropolis-Hastings (MH) algorithm is a way to sample a provided target distribution π(x). It works by repeatedly sampling a separate proposal distribution T (x, x) to generate a random walk {x(t)}. We consider a modification of the MH algorithm in which T is dynamically updated during the walk. The update at time t uses the {x(t < t)} to estimate the product distribution that has the least...
متن کامل"mastermind by Importance Sampling and Metropolis- Hastings"
Two machine learning algorithms are introduced for playing a one player version of the logical game Mastermind. In the classic game of Mastermind there are two players: the encoder and the decoder. The encoder builds a secret code by selecting a sequence of four pegs, each chosen from six different colors. The decoder then attempts to guess the secret code in as few turns as possible. In this v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2011
ISSN: 0028-0836,1476-4687
DOI: 10.1038/nature09770